Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
981	Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2010-11-05 18:41:12 Complexity classes Community websites Mathematical optimization Conjectures P versus NP problem Structural complexity theory Stack Exchange Network NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
982	Electives/Transfer Courses/Application of Theory Revised[removed]If working with a Mac computer, please print and complete this form by hand. Follow the direction below to submit. Revised[removed] Add to Reading List Source URL: www.peru.edu Language: English - Date: 2014-08-21 11:50:53 Course credit Course Thesis Education Knowledge Academic transfer
983	Theory and Applications of Categories, Vol. 27, No. 5, 2012, pp. 65–79. WEAKLY MAL’TSEV CATEGORIES AND STRONG RELATIONS ZURAB JANELIDZE AND NELSON MARTINS-FERREIRA Abstract. We define a strong relation in a category Add to Reading List Source URL: www.emis.de Language: English - Date: 2012-07-27 13:15:00 Functors Pullback Span Limit Diagram Category Equaliser Complete category Factorization system Category theory Mathematics Abstract algebra
984	Logic and Lattices for Distributed Programming Neil Conway William Marczak Peter Alvaro Joseph M. Hellerstein Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2012-06-22 16:27:05 Lattice theory Algebra Order theory Lattice Semilattice Class Boolean algebra Monotonic function Complete Heyting algebra Abstract algebra Mathematics Algebraic structures
985	footballcommentary.com By a pass of i units we mean one which, if complete, has an expected gain of i distance units. The available distances are i = 1, . . . , k. Let pi denote the probability that such a pass is comple Add to Reading List Source URL: www.footballcommentary.com Language: English - Date: 2005-06-11 12:21:04 Multivariable calculus Lagrange multiplier Multiplier Spectral theory Ordinary differential equations Mathematical analysis Fourier analysis Mathematical optimization
986	Local Search: Is Brute-Force Avoidable? Add to Reading List Source URL: ijcai.org Language: English - Date: 2009-06-22 08:17:00 Planar graphs NP-complete problems Tree decomposition Minor Apex graph Graph Clique-sum Neighbourhood Vertex cover Graph theory Theoretical computer science Graph operations
987	Pricing Network Edges to Cross a River Alexander Grigoriev1 , Stan van Hoesel1 , Anton F. van der Kraaij1 , Marc Uetz1 , and Mustapha Bouhtou2 1 Maastricht University, Quantitative Economics, P.O.Box 616, Add to Reading List Source URL: wwwhome.math.utwente.nl Language: English - Date: 2005-01-11 07:55:58 Complexity classes Operations research Network theory NP Shortest path problem Optimization problem Approximation algorithm Strongly NP-complete Flow network Theoretical computer science Computational complexity theory Applied mathematics
988	Separability and Topology Control of Quasi Unit Disk Graphs Jianer Chen∗, Anxiao(Andrew) Jiang∗, Iyad A. Kanj† , Ge Xia‡ , and Fenghui Zhang∗ ∗ Dept. of Computer Science, Texas A&M Univ. College Station, TX Add to Reading List Source URL: www.cs.lafayette.edu Language: English - Date: 2006-11-14 14:35:41 Tree Graph Vertex Planar graph Connectivity Induced path Planar separator theorem Path decomposition Graph theory Graph operations NP-complete problems
989	P, N P and Mathematics – a computational complexity perspective Avi Wigderson “P versus N P – a gift to mathematics from Computer Science” Steve Smale. Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2006-03-15 13:50:29 Complexity classes Mathematical optimization Structural complexity theory Mathematical logic P NP-complete Decision problem Algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
990	The x-and-y-axes travelling salesman problem Eranda C ¸ ela∗ Vladimir Deineko†‡ Add to Reading List Source URL: www.opt.math.tu-graz.ac.at Language: English - Date: 2012-08-17 06:11:47 NP-complete problems Operations research Elementary mathematics Travelling salesman problem Computational complexity theory Analytic geometry Combinatorial optimization Distance Cartesian coordinate system Mathematics Theoretical computer science Applied mathematics

UPDATE